Logical Theories for Fragments of Elementary Geometry
نویسندگان
چکیده
We survey models and theories of geometric structures of parallelism, orthogonality, incidence, betweenness and order, thus gradually building towards full elementary geometry of Euclidean spaces, in Tarski’s sense. Besides the geometric aspects of such structures we look at their logical (first-order and modal) theories and discuss logical issues such as: expressiveness and definability, axiomatizations and representation results, completeness and decidability, and interpretations between structures and theories.
منابع مشابه
Undecidable fragments of elementary theories
We introduce a general framework to prove undecidability of fragments. This is applied to fragments of theories arising in algebra and recursion theory. For instance, the V3V-theories of the class of finite distributive lattices and of the p.o. of recursively enumerable many-one degrees are shown to be undecidable.
متن کاملSome new results on decidability for elementary algebra and geometry
We carry out a systematic study of decidability for theories of (a) real vector spaces, inner product spaces, and Hilbert spaces and (b) normed spaces, Banach spaces and metric spaces, all formalised using a 2-sorted first-order language. The theories for list (a) turn out to be decidable while the theories for list (b) are not even arithmetical: the theory of 2-dimensional Banach spaces, for e...
متن کاملAn Application of Logic to Combinatorial Geometry: How Many Tetrahedra are Equidecomposable with a Cube?
It is known (Rapp, 1985) that elementary geometry with an additional quantifier “there exist uncountably many” is decidable. We show that this decidability helps in solving the following problem from combinatorial geometry: does there exist an uncountable family of pair-wise non-congruent tetrahedra that are n−equidecomposable with a cube? DEFINITION 1. By an elementary geometry, following [Tar...
متن کاملThe Algorithmic Complexity of Decomposability in Fragments of First-Order Logic
The research on applied logic in the mid 2000s has brought important methodological and algorithmic results on modularization of finitely axiomatizable logical theories. In particular, the research has been focused on the question whether logical theories have an inherent modular structure which could allow one to identify, in some sense, independent “components” in theories and use them as bui...
متن کاملBounded Arithmetic in Free Logic
One of the central open questions in bounded arithmetic is whether Buss’ hierarchy of theories of bounded arithmetic collapses or not. In this paper, we reformulate Buss’ theories using free logic and conjecture that such theories are easier to handle. To show this, we first prove that Buss’ theories prove consistencies of induction-free fragments of our theories whose formulae have bounded com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007